#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 4e4+ 10;

int n, m;
vector<string> course[N];
struct Record{
    string name;
    vector<int> list;

    bool operator< (const Record & r) const {
        return name < r.name;
    } 

}record[N];

// 开启优化之后quickread()，cin，cout也要超时
inline void solution() {
    scanf("%d%d",&n, &n);
    for (int i = 0; i < n; i ++ ) {
        char tem[5];
        int cnt;
        scanf("%s%d", tem, &cnt);
        string name(tem);
        record[i].name = name;
        for (int _ = 0; _ < cnt; _ ++ ) {
            int idx;
            scanf("%d", &idx);
            record[i].list.push_back(idx);
        }
    }
    sort(record, record + n);
    for (int i = 0; i < n; i ++ ) {
        for (auto & v : record[i].list) 
            course[v].push_back(record[i].name);
    }
    
    for (int i = 1; i <= m; i ++ ) {
        printf("%d %d\n", i, course[i].size());
        for (auto & s : course[i])
            cout << s << endl;
    }
    return ;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}